Vectorised Spreading Activation algorithm for centrality measurement
نویسندگان
چکیده
منابع مشابه
Vectorised Spreading Activation Algorithm for Centrality Measurement
TROUSSOV, A., DAŘENA, F., ŽIŽKA, J., PARRA, D., BRUSILOVSKY, P.: Vectorised Spreading Activation algorithm for centrality measurement. Acta univ. agric. et silvic. Mendel. Brun., 2011, LIX, No. 7, pp. 469– 476 Spreading Activation is a family of graph-based algorithms widely used in areas such as information retrieval, epidemic models, and recommender systems. In this paper we introduce a novel...
متن کاملDiscovering Latent Informaion by Spreading Activation Algorithm for Document Retrieval
Syntactic search relies on keywords contained in a query to find suitable documents. So, documents that do not contain the keywords but contain information related to the query are not retrieved. Spreading activation is an algorithm for finding latent information in a query by exploiting relations between nodes in an associative network or semantic network. However, the classical spreading acti...
متن کاملA Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality
Results of correlation study (using Pearson's correlation coefficient, PCC) between decay centrality (DEC) vs. degree centrality (DEG) and closeness centrality (CLC) for a suite of 48 real-world networks indicate an interesting trend: PCC(DEC, DEG) decreases with increase in the decay parameter δ (0 < δ < 1) and PCC(DEC, CLC) decreases with decrease in δ. We make use of this trend of monotonic ...
متن کاملEffect of Cannabinoid Receptor Activation on Spreading Depression
Objective(s) The objective of this study was to evaluate the effect of cannabinoid on cortical spreading depression (CSD) in rat brain. Cannabis has been used for centuries for both symptomatic and prophylactic treatment of different types of headaches including migraine. CSD is believed to be a putative neuronal mechanism underlying migraine aura and subsequent pain. Materials and Methods T...
متن کاملTowards Improving Brandes' Algorithm for Betweenness Centrality
Betweenness centrality, measuring how many shortest paths pass through a vertex, is one of the most important network analysis concepts for assessing the (relative) importance of a vertex. The famous state-of-art algorithm of Brandes [2001] computes the betweenness centrality of all vertices in O(mn) worst-case time on an n-vertex and m-edge graph. In practical follow-up work, significant empir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis
سال: 2014
ISSN: 1211-8516,1211-8516
DOI: 10.11118/actaun201159070469